Using Ford-fulkerson Algorithm and Max Flow- Min Cut Theorem to Minimize Traffic Congestion in Kota Kinabalu, Sabah
نویسندگان
چکیده
Traffic congestion is a major urban transportation problem which occurs when the traffic volume exceeds the capacity of existing road facilities. The occurring of traffic congestion is due to the freedom of owning private vehicle, poor traffic facility and unrestricted urban population growth. In this study, identification of maximum flow and bottleneck path in Kota Kinabalu, Sabah, Malaysia was carried out. The scope of this study is a network within the Central Business District of Kota Kinabalu. All the possible routes from source to sink will be established. In term of data collection, manual traffic count was used with the help of video recording. Ford & Fulkerson Algorithm will be applied to find out the maximum flow. Next, the max-flow and min-cut theorem will be used to determine the bottlenecks of a network. It allows the traffic engineer to decide which roadways facilities should be improved in order to minimize the traffic congestion problem.
منابع مشابه
5.1 Introduction and Recap 5.2 Bipartite Matching Fig 1 : Bipartite Graph
In the last lecture, we analyzed the problem of finding the maximum flow in a graph, and how it can be efficiently solved using the Ford-Fulkerson algorithm. We also came across the Min Cut-Max Flow Theorem which relates the size of the maximum flow to the size of the minimal cut in the graph. In this lecture, we will be seeing how various different problems can be solved by reducing the proble...
متن کاملGraphs with no K3,3 Minor Containing a Fixed Edge
It is well known that every cycle of a graph must intersect every cut in an even number of edges. For planar graphs, Ford and Fulkerson proved that, for any edge e, there exists a cycle containing e that intersects every minimal cut containing e in exactly two edges. The main result of this paper generalizes this result to any nonplanar graph G provided G does not have a K 3,3 minor containing ...
متن کاملMulticut Survey
Graph cut problems are widely studied in the area of approximation algorithms. The most basic cut problem is the s-t minimum cut problem, for which Ford and Fulkerson gave an exact algorithm and illustrated max-flow min-cut relationship. This min-max theorem has led researchers to seek its generalization to the case of multicommodity flow. In this setting, each commodity has its own source and ...
متن کاملFolder complexes and multiflow combinatorial dualities By Hiroshi
In multiflow maximization problems, there are several combinatorial duality relations, such as Ford-Fulkerson’s max-flow min-cut theorem for single commodity flows, Hu’s max-biflow min-cut theorem for two-commodity flows, Lovász-Cherkassky duality theorem for free multiflows, and so on. In this paper, we provide a unified framework for such multiflow combinatorial dualities by using the notion ...
متن کاملD. Ray Fulkerson and Project Scheduling
D. Ray Fulkerson (1922–1976) made fundamental and lasting contributions to combinatorial mathematics, optimization, and operations research [2]. He is probably best known for his work on network flows and in particular for the famous max flow–min cut theorem, stating that the maximum amount of a flow from a node s to a node t in a directed graph equals the minimum capacity of a cut separating s...
متن کامل